University Timetable Generator Using Tabu Search
نویسندگان
چکیده
منابع مشابه
Graph Partitioning Using Tabu Search
In this paper, we present another approach to the balanced minimum cut graph partitioning problem. This approach is based on the meta-heuristic known as tabu search. Our experimental results compare favorably with two of the most effecitive methods available in terms of quality of solutions and computational times. Our experience and experiments suggest that this technique can be applied effect...
متن کاملA Tabu Search Algorithm to Schedule University Examinations?
A combination of heuristics, based on Tabu Search, first finds a solution in which no student has two exams simultaneously and then improves it by evenly spacing the exams in the examination period. The algorithm has been imbedded into a package to be used by Faculty administrators and proposes solutions to be considered by the parties involved: administration, departments and students. Computa...
متن کاملTabu Search: an Efficient Metaheuristic for University Organization Problems
In the last 10 years we have been working on large scale academic organization problems. For the university we have worked on exam scheduling, student assignment to sections, course scheduling and a process of student self-registration. The developed algorithms are quite complex and are based on different techniques, but for all of them the Tabu Search procedures have been the essential tool fo...
متن کاملTABU search
This article explores the meta-heuristic approach called tabu search, which is dramatically changing our ability to solve a host of problems in applied science, business and engineering. Tabu search has important links to evolutionary and “genetic” methods, often overlooked, through its intimate connection with scatter search and path relinking — evolutionary procedures that have recently attra...
متن کاملPerformance Driven Placement Using Tabu Search
Abstrllct. In this paper. we present an effective performance driven placement with glohal routing algorithm for macro cells. Our algorithm uses a hierarchical. divide and conquer, quad-partitioning approach. 'nle quad-partitioning routine uses the Tahu Search technique. Our algorithm uses the concept of proximity of regiuns tu approximate Ille interconnection delays during the placement proces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and Communications
سال: 2016
ISSN: 2327-5219,2327-5227
DOI: 10.4236/jcc.2016.416003